DAPA: Differential Analysis aided Power Attack on (Non-) Linear Feedback Shift Registers
نویسندگان
چکیده
منابع مشابه
Simple power analysis applied to nonlinear feedback shift registers
Linear feedback shift registers (LFSRs) and nonlinear feedback shift registers (NLFSRs) are major components of stream ciphers. It has been shown that, under certain idealized assumptions, LFSRs and LFSR-based stream ciphers are susceptible to cryptanalysis using simple power analysis (SPA). In this paper, we show that simple power analysis can be practically applied to a CMOS digital hardware ...
متن کاملAlgebraic Feedback Shift Registers
A general framework for the design of feedback registers based on algebra over complete rings is described. These registers generalize linear feedback shift registers and feedback with carry shift registers. Basic properties of the output sequences are studied: relations to the algebra of the underlying ring; synthesis of the register from the sequence (which has implications for cryptanalysis)...
متن کاملApplication of linear consistency test in a ciphertext-only attack on irregularly clocked linear feedback shift registers
Linear Consistency Test (LCT) is a well-known algebraic method of cryptanalysis of stream ciphers. In this paper, we use LCT in an attack on a noised irregularly clocked linear feedback shift register (LFSR). We show that it is possible to reconstruct the initial states of both the clocked and the clocking LFSR in this scheme by using an essentially algebraic attack method, such as LCT, as a bu...
متن کاملLocal Zeta Functions and Linear Feedback Shift Registers
We give a polynomial time algorithm for computing the Igusa local zeta function Z(s, f) attached to a polynomial f (x) ∈ Z[x], in one variable, with splitting field Q, and a prime number p. We also propose a new class of Linear Feedback Shift Registers based on the computation of Igusa's local zeta function.
متن کاملEfficient linear feedback shift registers with maximal period
Linear feedback shift registers (LFSR’s) are fundamental primitives in the theory and practice of pseudorandom number generation and coding theory (see, e.g., [1], [2], [3], [4], [6], [7], and references therein). Figure 1 describes a typical LFSR over the two-element field F2 = {0, 1}, where each step consists of adding some of the state bits (we follow the convention that the elements of F2 a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR Transactions on Cryptographic Hardware and Embedded Systems
سال: 2020
ISSN: 2569-2925
DOI: 10.46586/tches.v2021.i1.169-191